منابع مشابه
Hierarchical Heuristic Search Revisited
Pattern databases enable difficult search problems to be solved very quickly, but are large and time-consuming to build. They are therefore best suited to situations where many problem instances are to be solved, and less than ideal when only a few instances are to be solved. This paper examines a technique hierarchical heuristic search especially designed for the latter situation. The key idea...
متن کاملHierarchical Search on DisCSPs
Preface Two new distributed search algorithms for Distributed CSPs are proposed. In one algorithm, search is performed concurrently on disjoint parts of the global search space, by agents that constitute these parts. Agents form a hierarchy of groups and each group generates consistent partial solutions. Partial solutions are produced concurrently and are combined into consistent global solutio...
متن کاملHierarchical Search for Parsing
Both coarse-to-fine and A∗ parsing use simple grammars to guide search in complex ones. We compare the two approaches in a common, agenda-based framework, demonstrating the tradeoffs and relative strengths of each method. Overall, coarse-to-fine is much faster for moderate levels of search errors, but below a certain threshold A∗ is superior. In addition, we present the first experiments on hie...
متن کاملSearch Redu Hierarchical Prob
It has long been recognized that hierarchical problem solving can be used to reduce search. Yet, there has been little analysis of the problemsolving method and few experimental results. This paper provides the first comprehensive analytical and empirical demonstrations of the effectiveness of hierarchical problem solving. First, the paper shows analytically that hierarchical problem solving ca...
متن کاملSearch Reduction in Hierarchical Distributed
Knoblock and Korf have determined that abstraction can reduce search at a single agent from exponential to linear complexity Knoblock, 1991; Korf, 1987]. We extend their results by showing how concurrent problem solving among multiple agents using abstraction can further reduce search to logarithmic complexity. We empirically validate our formal analysis by showing that it correctly predicts pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics B
سال: 2007
ISSN: 0217-9792,1793-6578
DOI: 10.1142/s0217979207038344